Frédéric Abergel Bikas K . Chakrabarti

We discuss several stochastic optimization strategies in games with many players having large number of choices (Kolkata Paise Restaurant Problem) and two choices (minority game problem). It is seen that a stochastic crowd avoiding strategy gives very efficient utilization in KPR problem. A slightly modified strategy in the minority game problem gives full utilization but the dynamics stops after reaching full efficiency, thereby making the utilization helpful for only about half of the population (those in minority). We further discuss the ways in which the dynamics may be continued and the utilization becomes effective for all the agents keeping fluctuation arbitrarily small. A. Ghosh ( ) · S. Biswas · B.K. Chakrabarti Theoretical Condensed Matter Physics Division, Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Kolkata 700 064, India e-mail: [email protected] S. Biswas e-mail: [email protected] B.K. Chakrabarti e-mail: [email protected] A. Chatterjee Department of Biomedical Engineering and Computational Science (BECS), Aalto University School of Science, FI-00076 AALTO, Espoo, Finland e-mail: [email protected] A.S. Chakrabarti Economics Department, Boston University, 270 Bay State Road, Boston, MA, USA e-mail: [email protected] T. Naskar Theory Division, Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Kolkata 700 064, India e-mail: [email protected] M. Mitra · B.K. Chakrabarti Economic Research Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata 700 018, India M. Mitra e-mail: [email protected] F. Abergel et al. (eds.), Econophysics of Systemic Risk and Network Dynamics, New Economic Windows, DOI 10.1007/978-88-470-2553-0_12, © Springer-Verlag Italia 2013 173